Ramanujan Graphs with Small Girth
نویسنده
چکیده
We construct an infinite family of (q + 1)−regular Ramanujan graphs Xn of girth 1. We also give covering maps Xn+1 → Xn such that the minimal common covering of all the Xn’s is the universal covering tree.
منابع مشابه
Graphs With Large Girth And Large Chromatic Number
In the first part of these notes we use a probabilistic method to show the existence of graphs with large girth and large chromatic number. In the second part we give an explicit example of such graphs. It is mostly based on the third chapter of Some Applications Of Modular Forms by Peter Sarnak and also the third and forth chapters of Elementary Number Theory, Group Theory, And Ramanujan Graph...
متن کاملRecent Developments in Low-Density Parity-Check Codes
In this paper we prove two results related to low-density parity-check (LDPC) codes. The first is to show that the generating function attached to the pseudo-codewords of an LDPC code is a rational function, answering a question raised in [6]. The combinatorial information of its numerator and denominator is also discussed. The second concerns an infinite family of q-regular bipartite graphs wi...
متن کاملOn an Anti-Ramsey Property of Ramanujan Graphs
If G and H are graphs, we write G → H (respectively, G → TH) if for any proper edge-colouring γ of G there is a subgraph H ′ ⊂ G of G isomorphic to H (respectively, isomorphic to a subdivision of H) such that γ is injective on E(H ′). Let us write C for the cycle of length l. Spencer (cf. Erdős [10]) asked whether for any g ≥ 3 there is a graph G = Gg such that (i) G has girth g(G) at least g, ...
متن کامل8 Concluding Remarks and Further Work
15 the average degree of the nodes of a linear-sized induced subgraph of a k-regular Ramanujan graph is upper bounded by roughly 1 + p k ? 1, which is less than k=2 for k 7. This shows that Ramanujan graphs of degree at least 7 are extrovert graphs. Classical results 4] require the degree to be at least 15. 1. Let H be a graph of maximumdegree at most k, and a real number no smaller than 2 p k ...
متن کاملNetworks via Hilbert Modular Forms
Ramanujan graphs, introduced by Lubotzky, Phillips and Sarnak, allow the design of efficient communication networks. In joint work with B. Jordan we gave a higher-dimensional generalization. Here we explain how one could use this generalization to construct efficient communication networks which allow for a number of verification protocols and for the distribution of information along several c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 23 شماره
صفحات -
تاریخ انتشار 2003